Dynamic Potential Search on Weighted Graphs
نویسندگان
چکیده
Dynamic Potential Search (DPS) is a recently introduced search algorithm that returns a bounded-suboptimal cost solution. DPS orders nodes in the open-list based on their potentialwhich is a combination of both the gand h-values of a node. In this paper we study the behavior of DPS on weighted graphs. In particular, we develop a new variant of DPS, called DPSUwhich calculates the potential by counting one for each edge regardless of its costs. We develop an eager version and a restrained version of DPSU. We then compare all these algorithms on a number of weighted graphs and study the pros and cons of each of them.
منابع مشابه
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem
Given an undirected and vertex weighted graph G = (V,E,w), the Weighted Feedback Vertex Problem (WFVP) consists of finding a subset F ⊆ V of vertices of minimum weight such that each cycle in G contains at least one vertex in F . The WFVP on general graphs is known to be NP-hard and to be polynomially solvable on some special classes of graphs (e.g., interval graphs, co-comparability graphs, di...
متن کاملFully-Dynamic Approximation of Betweenness Centrality
Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Since an exact computation is prohibitive in large networks, several approximation algorithms have been proposed. Besides that, recent years have seen the publication of dynamic algorithms for efficient recomputation of betweenness in evolving networks. In previou...
متن کاملOPTIMAL SHAPE DESIGN OF GRAVITY DAMS BASED ON A HYBRID META-HERURISTIC METHOD AND WEIGHTED LEAST SQUARES SUPPORT VECTOR MACHINE
A hybrid meta-heuristic optimization method is introduced to efficiently find the optimal shape of concrete gravity dams including dam-water-foundation rock interaction subjected to earthquake loading. The hybrid meta-heuristic optimization method is based on a hybrid of gravitational search algorithm (GSA) and particle swarm optimization (PSO), which is called GSA-PSO. The operation of GSA-PSO...
متن کاملDynamic Contrast Magnetic Resonance Imaging (DCE-MRI) and Diffusion Weighted MR Imaging (DWI) for Differentiation between Benign and Malignant Salivary Gland Tumors
Background: Salivary gland tumors form nearly 3% of head and neck tumors. Due to their large histological variety and vicinity to facial nerves, pre-operative diagnosis and differentiation of benign and malignant parotid tumors are a major challenge for radiologists. Objective: The majority of these tumors are benign; however, sometimes they tend to transform into a malignant form. Functional M...
متن کاملAlgorithms of Fast Search of Center, Radius and Diameter on Weighted Graphs
Two problems in the search of metric characteristics on weighted undirected graphs with non-negative edge weights are being considered. The first problem: a weighted undirected graph with non-negative edge weight is given. The radius, diameter and at least one center and one pair of peripheral vertices of the graph are to be found. In the second problem we have additionally calculated the dista...
متن کامل